Quantum-Statistical Annealing Computation

نویسندگان

  • Giuseppe Castagnoli
  • David Ritz Finkelstein
چکیده

We develop a quantum computer architecture using quantum statistics and thermal annealing that is highly parallel and robust with respect to decoherence. The most general bounded computation can be expressed as solving a Boolean network. Quantum-statistical annealing (qusa) computation satisfies all Boolean relations more complicated than equality with quantum statistics, which takes no time, and satisfies equality relations alone with thermal annealing. We estimate the qusa computation time and show that there is a genuine speed up. At the level of principle, we show that for qusa computation NP=P.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum-Statistical Computation

In quantum ground-mode computation, the logical relations among qubits that must be satisfied by the solution are realized when a quantum network representing the problem has minimum energy. In quantum statistical computation some of the logical relations among the variables of the problem are satisfied identically in virtue of quantum statistics, which takes no time, leaving only the remaining...

متن کامل

Quantum Annealing with Markov Chain Monte Carlo Simulations and D-Wave Quantum Computers

Quantum computation performs calculations by using quantum devices instead of electronic devices following classical physics and used by classical computers. Although general purpose quantum computers of practical scale may be many years away, special purpose quantum computers are being built with capabilities exceeding classical computers. One prominent case is the so-called D-Wave quantum com...

متن کامل

A Quantum Approach to Classical Statistical Mechanics

We present a new approach to study the thermodynamic properties of d-dimensional classical systems by reducing the problem to the computation of ground state properties of a d-dimensional quantum model. This classical-to-quantum mapping allows us to deal with standard optimization methods, such as simulated and quantum annealing, on an equal basis. Consequently, we extend the quantum annealing ...

متن کامل

Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice

Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd adiabatic quantum computation and quantum annealing theory and practice catherine c m...

متن کامل

Quantum Annealing and Analog Quantum Computation

We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of such computationally hard problems to the classical spin glass problems. The quantum spin glass problems arise with the introduction of quantum fluctuations, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001